Fuzzy c-means clustering algorithm for directional data (FCM4DD)

نویسندگان

  • Orhan Kesemen
  • Özge Tezel
  • Eda Özkul
چکیده

Cluster analysis is a useful tool used commonly in data analysis. The purpose of cluster analysis is to separate data sets into subsets according to their similarities and dissimilarities. In this paper, the fuzzy c-means algorithm was adapted for directional data. In the literature, several methods have been used for the clustering of directional data. Due to the use of trigonometric functions in these methods, clustering is performed by approximate distances. As opposed to other methods, the FCM4DD uses angular difference as the similarity measure. Therefore, the proposed algorithm is a more consistent clustering algorithm than others. The main benefit of FCM4DD is that the proposed method is effectively a distribution-free approach to clustering for directional data. It can be used for N-dimensional data as well as circular data. In addition to this, the importance of the proposed method is that it would be applicable for decision making process, rule-based expert systems and prediction problems. In this study, some existing clustering algorithms and the FCM4DD algorithm were applied to various artificial and real data, and their results were compared. As a result, these comparisons show the superiority of the FCM4DD algorithm in terms of consistency, accuracy and computational time. Fuzzy clustering algorithms for directional data (FCM4DD and FCD) were compared according to membership values and the FCM4DD algorithm obtained more acceptable results than the FCD algorithm. © 2016 Elsevier Ltd. All rights reserved. M f ( t a w m M c B t b ( l M m s ( p C

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fuzzy C-means Algorithm for Clustering Fuzzy Data and Its Application in Clustering Incomplete Data

The fuzzy c-means clustering algorithm is a useful tool for clustering; but it is convenient only for crisp complete data. In this article, an enhancement of the algorithm is proposed which is suitable for clustering trapezoidal fuzzy data. A linear ranking function is used to define a distance for trapezoidal fuzzy data. Then, as an application, a method based on the proposed algorithm is pres...

متن کامل

OPTIMIZATION OF FUZZY CLUSTERING CRITERIA BY A HYBRID PSO AND FUZZY C-MEANS CLUSTERING ALGORITHM

This paper presents an efficient hybrid method, namely fuzzy particleswarm optimization (FPSO) and fuzzy c-means (FCM) algorithms, to solve the fuzzyclustering problem, especially for large sizes. When the problem becomes large, theFCM algorithm may result in uneven distribution of data, making it difficult to findan optimal solution in reasonable amount of time. The PSO algorithm does find ago...

متن کامل

High Performance Implementation of Fuzzy C-Means and Watershed Algorithms for MRI Segmentation

Image segmentation is one of the most common steps in digital image processing. The area many image segmentation algorithms (e.g., thresholding, edge detection, and region growing) employed for classifying a digital image into different segments. In this connection, finding a suitable algorithm for medical image segmentation is a challenging task due to mainly the noise, low contrast, and steep...

متن کامل

High Performance Implementation of Fuzzy C-Means and Watershed Algorithms for MRI Segmentation

Image segmentation is one of the most common steps in digital image processing. The area many image segmentation algorithms (e.g., thresholding, edge detection, and region growing) employed for classifying a digital image into different segments. In this connection, finding a suitable algorithm for medical image segmentation is a challenging task due to mainly the noise, low contrast, and steep...

متن کامل

Bilateral Weighted Fuzzy C-Means Clustering

Nowadays, the Fuzzy C-Means method has become one of the most popular clustering methods based on minimization of a criterion function. However, the performance of this clustering algorithm may be significantly degraded in the presence of noise. This paper presents a robust clustering algorithm called Bilateral Weighted Fuzzy CMeans (BWFCM). We used a new objective function that uses some k...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Expert Syst. Appl.

دوره 58  شماره 

صفحات  -

تاریخ انتشار 2016